Extending Babuška-Aziz’s theorem to higher-order Lagrange interpolation

Extending STR to a Higher-Order Consistency

One of the most widely studied classes of constraints in constraint programming (CP) is that of table constraints. Numerous specialized filtering algorithms, enforcing the wellknown property called generalized arc consistency (GAC), have been developed for such constraints. Among the most successful GAC algorithms for table constraints, we find variants of simple tabular reduction (STR), like S...

Lagrange Multipliers for Higher Order Elliptic Operators

In this paper, the Babuška’s theory of Lagrange multipliers is extended to higher order elliptic Dirichlet problems. The resulting variational formulation provides an efficient numerical squeme in meshless methods for the approximation of elliptic problems with essential boundary conditions. Mathematics Subject Classification. 41A10, 41A17, 65N15, 65N30. Received: April 5, 2004.

Higher-Order Automated Theorem Proving

The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification...

Higher-Order Automated Theorem Provers

On Multivariate Lagrange Interpolation

Lagrange interpolation by polynomials in several variables is studied through a finite difference approach. We establish an interpolation formula analogous to that of Newton and a remainder formula, both of them in terms of finite differences. We prove that the finite difference admits an integral representation involving simplex spline functions. In particular, this provides a remainder formul...